package leetcode.dynamic;

/**
 * @Description: https://leetcode.cn/problems/li-wu-de-zui-da-jie-zhi-lcof/
 * @Author Ammar
 * @Create 2023/7/14 11:17
 */
public class _剑指offer_47_礼物的最大价值 {
    public int maxValue(int[][] grid) {
        int row = grid.length;
        int col = grid[0].length;

        int[][] dp = new int[row][col];
        dp[0][0] = grid[0][0];

        for (int i = 1; i < row; i++) {
            dp[i][0] = dp[i - 1][0] + grid[i][0];
        }

        for (int i = 1; i < col; i++) {
            dp[0][i] = dp[0][i - 1] + grid[0][i];
        }
        for (int i = 1; i < row; i++) {
            for (int j = 1; j < col; j++) {
                dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]) + grid[i][j];
            }
        }

        return dp[row - 1][col - 1];
    }
}
